Constructions for Key Distribution Pattern using Resolvable Designs
نویسندگان
چکیده
Key distribution patterns (KDPs) are finite incidence structures satisfying a certain property which makes them widely used in minimizing the key storage and ensuring the security of communication between users in a large network. In this paper we discuss the close connection between resolvable designs and KDPs, and convert the constructions of KDPs into the constructions of resolvable designs. Finally, we give a construction of (q2, q, 1)ARBIBD and generalize it to constructions of resolvable design with qn (n is a integer and n ≥ 2) points by mathematical induction. Key–Words: Key distribution pattern, finite incidence structure, resolvable design
منابع مشابه
Constructions of uniform designs by using resolvable packings and coverings
In this paper, uniform designs are constructed based on nearly U-type designs and the discrete discrepancy. The link between such uniform designs and resolvable packings and coverings in combinatorial design theory is developed. Through resolvable packings and coverings without identical parallel classes, many infinite classes of new uniform designs are then produced.
متن کاملClass-Uniformly Resolvable Group Divisible Structures I: Resolvable Group Divisible Designs
We consider Class-Uniformly Resolvable Group Divisible Designs (CURGDD), which are resolvable group divisible designs in which each of the resolution classes has the same number of blocks of each size. We derive the fully general necessary conditions including a number of extremal bounds. We present some general constructions including a novel construction for shrinking the index of a master de...
متن کاملUniform Designs and Their Combinatorial Constructions
Uniform designs has been widely used in various fields. In this talk, two constructions for uniform designs from combinatorics are presented. One is obtained by resolvable PPBDs which serves to unify some known combinatorial constructions. The other provides a recursive method to obtain a new three-level uniform design from old one.
متن کاملDifference families with applications to resolvable designs
Some block disjoint difference families are constructed in rings with the property that there are k distinct units uit 0 < i < k — 1, such that differences ut — Uj (0 < i < j < k — 1) are all units. These constructions are utilized to produce a large number of classes of resolvable block designs.
متن کامل